Cut vertex and cut edge problem for topological graph indices
نویسندگان
چکیده
منابع مشابه
The Vertex k-cut Problem
Given an undirected graph G = (V,E), a vertex k-cut of G is a vertex subset of V the removing of which disconnects the graph in at least k connected components. Given a graph G and an integer k ≥ 2, the vertex k-cut problem consists in finding a vertex k-cut of G of minimum cardinality. We first prove that the problem is NP-hard for any fixed k ≥ 3. We then present a compact formulation, and an...
متن کاملThe min-cut and vertex separator problem
We consider graph three-partitions with the objective of minimizing the number of edges between the first two partition sets while keeping the size of the third block small. We review most of the existing relaxations for this min-cut problem and focus on a new class of semidefinite relaxations, based on matrices of order 2n+ 1 which provide a good compromise between quality of the bound and com...
متن کاملDistributed Vertex-Cut Partitioning
Graph processing has become an integral part of big data analytics. With the ever increasing size of the graphs, one needs to partition them into smaller clusters, which can be managed and processed more easily on multiple machines in a distributed fashion. While there exist numerous solutions for edge-cut partitioning of graphs, very little effort has been made for vertex-cut partitioning. Thi...
متن کاملSBV-Cut: Vertex-cut based graph partitioning using structural balance vertices
Article history: Received 6 January 2011 Received in revised form 8 November 2011 Accepted 8 November 2011 Available online 21 November 2011 Graphs are used for modeling a large spectrum of data from the web, to social connections between individuals, to concept maps and ontologies. As the number and complexities of graph based applications increase, rendering these graphs more compact, easier ...
متن کاملMaximum Cut Problem, MAX-CUT
The MAXIMUM CUT problem (MAX-CUT) is one of the simplest graph partitioning problems to conceptualize, and yet it is one of the most difficult combinatorial optimization problems to solve. The objective of MAX-CUT is to partition the set of vertices of a graph into two subsets, such that the sum of the weights of the edges having one endpoint in each of the subsets is maximum. This problem is k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Taibah University for Science
سال: 2019
ISSN: 1658-3655
DOI: 10.1080/16583655.2019.1695520